On the generalized Fischer-Burmeister merit function for the second-order cone complementarity problem

نویسندگان

  • Shaohua Pan
  • Sangho Kum
  • Yongdo Lim
  • Jein-Shan Chen
چکیده

It has been an open question that whether the family of merit functions ψp (p > 1), the generalized Fischer-Burmeister (FB) merit function, associated to the second order cone is smooth or not. In this paper we answer it partly, and show that ψp is smooth for The author’s work is supported by National Young Natural Science Foundation (No. 10901058) and Guangdong Natural Science Foundation (No. 9251802902000001). E-mail: [email protected]. The authors’ work is supported by Basic Science Research Program through NRF Grant No. 20120001740. E-mail: [email protected]. The author’s work is supported by the National Research Foundation of Korea (NRF) grant funded by the Korea government(MEST) (No.2012-005191). E-mail: [email protected]. Corresponding author. Member of Mathematics Division, National Center for Theoretical Sciences, Taipei Office. The author’s work is supported by National Science Council of Taiwan. E-mail: [email protected].

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An unconstrained smooth minimization reformulation of the second-order cone complementarity problem

A popular approach to solving the nonlinear complementarity problem (NCP) is to reformulate it as the global minimization of a certain merit function over IR. A popular choice of the merit function is the squared norm of the Fischer-Burmeister function, shown to be smooth over IR and, for monotone NCP, each stationary point is a solution of the NCP. This merit function and its analysis were sub...

متن کامل

A descent method for a reformulation of the second-order cone complementarity problem

Analogous to the nonlinear complementarity problem (NCP) and the semidefinite complementarity problem (SDCP), a popular approach to solving the secondorder cone complementarity problem (SOCCP) is to reformulate it as an unconstrained minimization of a certain merit function over IR. In this paper, we present a descent method for solving the unconstrained minimization reformulation of the SOCCP ...

متن کامل

A damped Gauss-Newton method for the second-order cone complementarity problem

We investigate some properties related to the generalized Newton method for the Fischer-Burmeister (FB) function over second-order cones, which allows us to reformulate the second-order cone complementarity problem (SOCCP) as a semismooth system of equations. Specifically, we characterize the B-subdifferential of the FB function at a general point and study the condition for every element of th...

متن کامل

Proximal Point Algorithm for Nonlinear Complementarity Problem Based on the Generalized Fischer-burmeister Merit Function

This paper is devoted to the study of the proximal point algorithm for solving monotone and nonmonotone nonlinear complementarity problems. The proximal point algorithm is to generate a sequence by solving subproblems that are regularizations of the original problem. After given an appropriate criterion for approximate solutions of subproblems by adopting a merit function, the proximal point al...

متن کامل

A regularization method for the second - order cone complementarity problem with the Cartesian P 0 - property

We consider the Tikhonov regularization method for the second-order cone complementarity problem (SOCCP) with the Cartesian P0-property. We show that many results of the regularization method for the P0 nonlinear complementarity problem still hold for this important class of nonmonotone SOCCP. For example, under the more general setting, every regularized problem has a unique optimal solution, ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Math. Comput.

دوره 83  شماره 

صفحات  -

تاریخ انتشار 2014